#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, m, q;
    cin >> n >> m >> q;
    V<int> w(n + 1, 0);
    V<int> cnt(m + 1, 0);
    FOR(i, 1, n) cin >> w[i], cnt[w[i]] ^= 1;

    V<int> odd(m + 1, 1e18);

    FOR(i, 0, m) {
        if (cnt[i]) {
            odd[i] = 0;
        }
    }

    FORD(i, 1, m) odd[i - 1] = min(odd[i - 1], odd[i] + 1);
    odd[m] = min(odd[m], odd[0]);
    FORD(i, 1, m) odd[i - 1] = min(odd[i - 1], odd[i] + 1);
    int c = 0;

    while (q--) {
        int op, x;
        cin >> op;
        if (op == 1)
            c++;
        else {
            cin >> x;
            int t = min(c, odd[w[x]]);
            cout << (w[x] + t - 1) % m + 1 << endl;
        }
    }
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
